t=int(input())
for i in range(t):
n,m,x,y=map(int,input().split())
print(1,1,n,m)#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>> t;
while(t--){
int n,m,i,j;
cin>>n>>m>>i>>j;
if((i==1 && j==1 )||( i==n && j==m)){
cout<< n << " 1" << " 1 " << m << endl;
}
else if((i==n && j==1 )||( i==1 && j==m)){
cout<< "1"<<" 1 "<< n << " " << m << endl;
}
else{
cout<< "1"<<" 1 "<< n << " " << m << endl;
}
}return 0;
} 1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |